On locally k-critically n-connected graphs
نویسندگان
چکیده
منابع مشابه
On critically k-edge-connected graphs
Let G be a simple graph on n vertices having edge-connectivity /(.' (G) > a and minimum degree o(G) We say G is k-critical if /(.' (G) = k and /(.' (G e) < k for every edge e of G. In this paper we prove that a k-critical graph has 1<' (G) o(G). We descri be a number of classes of k-cri tical graphs and consider the problem of determining the edge-maximal ones.
متن کاملSpanning k-Trees of n-Connected Graphs
A tree is called a k-tree if the maximum degree is at most k. We prove the following theorem, by which a closure concept for spanning k-trees of n-connected graphs can be defined. Let k ≥ 2 and n ≥ 1 be integers, and let u and v be a pair of nonadjacent vertices of an n-connected graph G such that degG(u)+degG(v) ≥ |G|−1−(k−2)n, where |G| denotes the order of G. Then G has a spanning k-tree if ...
متن کاملCritically «connected Graphs
The following result is proved. Every «-connected graph contains either a vertex whose removal results in a graph which is also «-connected or a vertex of degree less than (3n—1)/2. Introduction. A graph G is said to be n-connected if the removal of fewer than « vertices from G neither disconnects it nor reduces it to the trivial graph consisting of a single vertex. The maximum value of « for w...
متن کاملThe characterization of edge-maximal critically k-edge connected graphs
Let G be a simple graph on n vertices having edge-connectivity 1(' (G) > O. We say G is k-critical if 1(' (G) :::: k and 1(1 (G-e) < k for every edge e of G. We denote by ~(n,k) the set of all k-critical graphs on n vertices. In this paper we prove that the maximum number of edges of a graph G in ~(n,k) to be: k(n-k) if n ~ 3k; and L ~ (n+k)2 J. if k + 1 s n < 3k. Further, we characterise the e...
متن کاملOn critically k-extendable graphs
Let G be a simple connected graph on 2n vertices with a perfect matching. G is k-extendable if for any set M of k independent edges, there exists a perfect matching in G containing all the edges of M. G is critically k-extendable if G is k-extendable but G + uv is not k-extendable for any non-adjacent pair of vertices u and v of G. The problem that arises is that of characterizing k-extendable ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1993
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90575-e